A Simpler Proof of Mirzakhani’s Simple Curve Asymptotics
نویسندگان
چکیده
منابع مشابه
A Simpler Proof of Mirzakhani’s Simple Curve Asymptotics
In [7] M. Mirzakhani shows that the number of closed geodesics of length bounded above by L in the mapping class group orbit of a fixed curve γ on a hyperbolic surface X grows like a (positive) constant times L,where T(X) is the Teichmüller space ofX.This result, together with the obvious (but easy to miss) observation that simple curves fall into afinite number of orbits, impliesmyconjecture t...
متن کاملA simple proof of Zariski's Lemma
Our aim in this very short note is to show that the proof of the following well-known fundamental lemma of Zariski follows from an argument similar to the proof of the fact that the rational field $mathbb{Q}$ is not a finitely generated $mathbb{Z}$-algebra.
متن کاملA Simpler proof of Jensen's Coding Theorem
[82] provides a proof of Jensen's remarkable Coding Theorem , which demonstrates that the universe can be included in L[R] for some real R, via class forcing. The purpose of this article is to present a simpler proof of Jensen's theorem, obtained by implementing some changes first developed for the theory of strong coding (Friedman [87]). The basic idea is to first choose A ⊆ ORD so that V = L[...
متن کاملA Simpler Proof Theory for Nominal Logic
Nominal logic is a variant of first-order logic which provides support for reasoning about bound names in abstract syntax. A key feature of nominal logic is the new-quantifier, which quantifies over fresh names (names not appearing in any values considered so far). Previous attempts have been made to develop convenient rules for reasoning with the new-quantifier, but we argue that none of these...
متن کاملMaking simple proofs simpler
An open partition p [Cod09a, Cod09b] of a tree T is a partition of the vertices of T with the property that, for each block B of p, the upset of B is a union of blocks of p. This paper deals with the number, NP(n), of open partitions of the tree, Vn, made of two chains with n points each, that share the root. We prove that the number of such partitions is given by the formula NPn = k=1 n j...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometriae Dedicata
سال: 2005
ISSN: 0046-5755,1572-9168
DOI: 10.1007/s10711-005-7153-1